Partitional fuzzy clustering methods based on adaptive quadratic distances 3
نویسندگان
چکیده
7 This paper presents partitional fuzzy clustering methods based on adaptive quadratic distances. The methods presented furnish a fuzzy partition and a prototype for each cluster by optimizing an adequacy criterion based on adaptive quadratic distances. These 9 distances change at each algorithm iteration and can either be the same for all clusters or different from one cluster to another. Moreover, various fuzzy partition and cluster interpretation tools are introduced. Experiments with real and synthetic data sets show 11 the usefulness of these adaptive fuzzy clustering methods and the merit of the fuzzy partition and cluster interpretation tools. © 2006 Published by Elsevier B.V. 13
منابع مشابه
Partitional fuzzy clustering methods based on adaptive quadratic distances
This paper presents partitional fuzzy clustering methods based on adaptive quadratic distances. The methods presented furnish a fuzzy partition and a prototype for each cluster by optimizing an adequacy criterion based on adaptive quadratic distances. These distances change at each algorithm iteration and can either be the same for all clusters or different from one cluster to another. Moreover...
متن کاملPrediction of slope stability using adaptive neuro-fuzzy inference system based on clustering methods
Slope stability analysis is an enduring research topic in the engineering and academic sectors. Accurate prediction of the factor of safety (FOS) of slopes, their stability, and their performance is not an easy task. In this work, the adaptive neuro-fuzzy inference system (ANFIS) was utilized to build an estimation model for the prediction of FOS. Three ANFIS models were implemented including g...
متن کاملFuzzy Partitional Clustering Algorithms
Fuzzy partitional clustering algorithms are widely used in pattern recognition field. Until now, more and more research results on them have been developed in the literature. In order to study these algorithms systematically and deeply, they are reviewed in this paper based on c-means algorithm, from metrics, entropy, and constraints on membership function or cluster centers. Moreover, the adva...
متن کاملAdaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocation algorithms involving the construction of the clusters at each iteration and the identification of a suitable representation or prototype (means, axes, probability laws, groups of elements, etc.) for each cluster by l...
متن کاملAdaptative Hausdorff Distances and Dynamic Clustering of Symbolic Interval Data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocation algorithms involving the construction of the clusters at each iteration and the identification of a suitable representation or prototype (means, axes, probability laws, groups of elements, etc.) for each cluster by l...
متن کامل